Inertial Flows, Slow Flows, and Combinatorial Identities for Delay Equations

Inertial and slow manifolds for delay equations with small delays

Yu. A. Ryabov and R. D. Driver proved that delay equations with small delays have Lipschitz inertial manifolds. We prove that these manifolds are smooth. In addition, we show that expansion in the small delay can be used to obtain the dynamical system on the inertial manifold. This justifies “post-Newtonian” approximation for delay equations.

Combinatorial Continuous Maximal Flows

Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of applications such as image segmentation, stereo, image stitching and texture synthesis. Algorithms based on the classical formulation of maxflow defined on a graph...

Kolmogorov inertial range for inhomogeneous turbulent flows.

Network Flows and Combinatorial Optimization

Combinatorial Flows and Their Normalisation

This paper introduces combinatorial flows that generalize combinatorial proofs such that they also include cut and substitution as methods of proof compression. We show a normalization procedure for combinatorial flows, and how syntactic proofs are translated into combinatorial flows and vice versa. 1998 ACM Subject Classification F.4.1 [Mathematical Logic] Proof Theory